An Impossibility Theorem on Beliefs in Games

نویسندگان

  • Adam Brandenburger
  • H. Jerome Keisler
چکیده

A paradox of self-reference in beliefs in games is identified, which yields a game-theoretic impossibility theorem akin to Russell’s Paradox. An informal version of the paradox is that the following configuration of beliefs is impossible: Ann believes that Bob assumes that Ann believes that Bob’s assumption is wrong This is formalized to show that any belief model of a certain kind must have a ‘hole.’ An interpretation of the result is that if the analyst’s tools are available to the players in a game, then there are statements that the players can think about but cannot assume. Connections are made to some questions in the foundations of game theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian

We prove an impossibility result for a randomness-efficient parallel repetition. Our result is motivated by an early result of Feige and Kilian (STOC’95), who proved an impossibility result for randomness-efficient parallel repetition for two prover games with small degree, i.e., when each prover has only few possibilities for the question of the other prover. In recent years, there have been i...

متن کامل

Arrow theorems in the fuzzy setting

Throughout this paper, our  main idea is to analyze the Arrovian approach in a fuzzy context, paying attention to different extensions of the classical Arrow's model arising in mathematical Social Choice to aggregate preferences that the agents define on a set of alternatives. There is a wide set of extensions. Some of them give rise to an impossibility theorem as in the Arrovian classical  mod...

متن کامل

From Degrees of Belief to Beliefs: Lessons from Judgment-Aggregation Theory

What is the relationship between degrees of belief and (all-or-nothing) beliefs? Can the latter be expressed as a function of the former, without running into paradoxes? We reassess this “belief-binarization” problem from the perspective of judgmentaggregation theory. Although some similarities between belief binarization and judgment aggregation have been noted before, the literature contains ...

متن کامل

Quantum voting and violation of Arrow’s Impossibility Theorem

Abstract We propose a quantum voting system in the spirit of quantum games such as the quantum Prisoner’s Dilemma. Our scheme violates a quantum analogue of Arrow’s Impossibility Theorem, which states that every (classical) constitution endowed with three innocuous-seeming properties is a dictatorship. Superpositions, interference, and entanglement of votes feature in voting tactics available t...

متن کامل

Agreeing to Disagree with Limit Knowledge

The possibility for agents to agree to disagree is considered in an extended epistemic-topological framework. In such an enriched context, Aumann’s impossibility theorem is shown to no longer hold. More precisely, agents with a common prior belief satisfying limit knowledge instead of common knowledge of their posterior beliefs may actually entertain distinct posterior beliefs. Hence, agents ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Studia Logica

دوره 84  شماره 

صفحات  -

تاریخ انتشار 2006